Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments

Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments

A Dung argumentation framework (AF) is a pair (A,R): A is a set of abstract arguments and R ⊆ A× A is a binary relation, so-called the attack relation, for capturing the conflicting arguments. “Labeling” based algorithms for enumerating extensions (i.e. sets of acceptable arguments) have been set out such that arguments (i.e. elements of A) are the only subject for labeling. In this paper we pr...

Intertranslatability of Labeling-Based Argumentation Semantics

Abstract Argumentation is a simple yet powerful formalism for modeling the human reasoning and argumentation process. Various semantics have been suggested with a view of arriving at coherent outcomes of the argumentation process. Two categories of semantics are well-known, extension-based semantics and labeling-based semantics. Translations between semantics are an important area of interest t...

Labeling Algorithms

University of Crete, Greece 15.

Finding Arguments as Sequence Labeling in Discourse Parsing

This paper describes our system for the CoNLL-2016 Shared Task on Shallow Discourse Parsing on English. We adopt a cascaded framework consisting of nine components, among which six are casted as sequence labeling tasks and the remaining three are treated as classification problems. All our sequence labeling and classification models are implemented based on linear models with averaged perceptro...

Genetic algorithms for map labeling